Method of marks for propositional linear temporal logic
نویسندگان
چکیده
منابع مشابه
Method of marks for propositional linear temporal logic
It is known that traditional techniques used to ensure termination of a decision procedure in non-classical logics are based on loop-checking, in general. Nowadays, effective loop-check techniques based on histories are used instead of unrestricted loop-check. These techniques are widely and successfully applied also for non-classical logics containing induction-like axioms. These induction-lik...
متن کاملPropositional Scopes in Linear Temporal Logic
In this paper, we address the problem of specifying a property in LTL over a subset of the states of a system under test, ignoring the rest of the states. A modern LTL semantics that applies for both finite and infinite traces is considered. We introduce specialized operators (syntax and semantic) that help specifying properties over propositional scopes, where each scope constitute a subset of...
متن کاملPropositional Linear Temporal Logic and Language Homomorphisms
When verifying speci cations of reactive systems|which are at least nonterminating computer programs|the complexity of the veri cation algorithm is a major problem of practical relevance. Speci cations of practical interest are usually too large to be veri ed by standard veri cation methods in an acceptable amount of time. So what can we do? We can try to get rid of information in the speci cat...
متن کاملTableau-Like Automata-Based Axiomatization for Propositional Linear Temporal Logic
Propositional Linear Temporal Logic (PLTL) is a very popular formalism for specification and verification of computer programs and systems. This extended abstract sketches a tableau-like axiomatization for PLTL based on automata-theoretic decision procedure coupled with tableau for local model checking of the propositional μ-Calculus. Propositional Linear Temporal Logic (PLTL) is a very popular...
متن کاملWeak Completeness Theorem for Propositional Linear Time Temporal Logic
We prove weak (finite set of premises) completeness theorem for extended propositional linear time temporal logic with irreflexive version of until-operator. We base it on the proof of completeness for basic propositional linear time temporal logic given in [20] which roughly follows the idea of the Henkin-Hasenjaeger method for classical logic. We show that a temporal model exists for every fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lietuvos matematikos rinkinys
سال: 2014
ISSN: 2335-898X,0132-2818
DOI: 10.15388/lmr.a.2014.09